Bounds for Resilient Functions and Orthogonal Arrays Extended Abstract
نویسندگان
چکیده
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in cryptology and the theory of algorithms. Among their applications are universal hashing, authentica-tion codes, resilient and correlation-immune functions, derandomization of algorithms, and perfect local randomizers. In this paper, we give new bounds on the size of orthogonal arrays using Delsarte's linear programming method. Then we derive bounds on resilient functions and discuss when these bounds can be met.
منابع مشابه
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in cryptology and the theory of algorithms. Among their applications are universal hashing, authentication codes, resilient and correlation-immune functions, derandomization of algorithms, and perfect local randomizers. In this paper, we give new explicit bounds on the size of orthogonal arrays usin...
متن کاملPandiagonal Multimagic Squares Based on Large Sets of Orthogonal Arrays
Large sets of orthogonal arrays (LOA) have been used to construct resilient functions and zigzag functions by D. R. Stinson. In this paper, a construction of pandiagonal t-multimagic squares of order n (PMS(n, t)) based on a special kind of LOA called quadruple LOA is presented. As its application, it is shown that there exists a PMS(q, t) for all odd prime power q ≥ 4t− 1 with t ≥ 2, which pro...
متن کاملExtended Jacobi and Laguerre Functions and their Applications
The aim of this paper is to introduce two new extensions of the Jacobi and Laguerre polynomials as the eigenfunctions of two non-classical Sturm-Liouville problems. We prove some important properties of these operators such as: These sets of functions are orthogonal with respect to a positive de nite inner product de ned over the compact intervals [-1, 1] and [0,1), respectively and also th...
متن کاملConstruction of resilient functions over a finite alphabet
We extend the notions of correlation-immune functions and resilient functions to functions over any nite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Stinson as we give an orthogonal array characterization and a Fourier transform characterization for resilient functions over any nite alphabet. This leads to a generalization of som...
متن کاملOn Integral Operator and Argument Estimation of a Novel Subclass of Harmonic Univalent Functions
Abstract. In this paper we define and verify a subclass of harmonic univalent functions involving the argument of complex-value functions of the form f = h + ¯g and investigate some properties of this subclass e.g. necessary and sufficient coefficient bounds, extreme points, distortion bounds and Hadamard product.Abstract. In this paper we define and verify a subclass of harmonic univalent func...
متن کامل